a, b, c, d, e, f = map(int, input().split())
if a == 0 and b != 0 and d != 0:
print("Ron")
elif c == 0 and d != 0:
print("Ron")
elif e == 0 and f != 0 and b != 0 and d != 0:
print("Ron")
elif b*d*f <= a*c*e:
print("Hermione")
else:
print("Ron")
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ff first
#define ss second
#define N 200100
const int mod = 1e9+7;
template<typename T>void print(vector<T>&a,int c=0) {
for(auto&it :a)cout << it+c<< " ";
cout << endl;
}
void fast() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
}
template<typename T>T lcm(T a, T b) {
return (a * b) / (__gcd(a, b));
}
int main(){
fast();
/* Code starts here -------------------------------------------> */
int t = 1;
// cin>>t;
while(t--) {
int a;cin>>a;
int b;cin>>b;
int c;cin>>c;
int d;cin>>d;
int e;cin>>e;
int f;cin>>f;
if(b * d * f > a * c * e || (!c && d) || (!a && b && c && d)) {
cout << "Ron\n";
}else cout << "Hermione\n";
}
return 0;
}755C - PolandBall and Forest | 456B - Fedya and Maths |
376B - IOU | 1623B - Game on Ranges |
1118A - Water Buying | 1462C - Unique Number |
301A - Yaroslav and Sequence | 38A - Army |
38C - Blinds | 1197A - DIY Wooden Ladder |
1717D - Madoka and The Corruption Scheme | 1296D - Fight with Monsters |
729D - Sea Battle | 788A - Functions again |
1245B - Restricted RPS | 1490D - Permutation Transformation |
1087B - Div Times Mod | 1213B - Bad Prices |
1726B - Mainak and Interesting Sequence | 1726D - Edge Split |
1726C - Jatayu's Balanced Bracket Sequence | 1726A - Mainak and Array |
1613C - Poisoned Dagger | 475B - Strongly Connected City |
652B - z-sort | 124B - Permutations |
1496C - Diamond Miner | 680B - Bear and Finding Criminals |
1036E - Covered Points | 1015D - Walking Between Houses |